backtracking algorithmの例文

例文

もっと例文:   1  2  3

1. The backtracking algorithm traverses this search tree depth-first order.
2. However, the backtracking algorithm may give exponential runtime.
3. So the list monad is a simple way to implement a backtracking algorithm in a lazy language.
4. Backtracking algorithms work by choosing an unassigned variable and recursively solve the problems obtained by assigning a value to this variable.
5. These are backtracking algorithms storing the cost of the best solution found during execution and using it to avoid part of the search.